Some rank equalities for finitely many tripotent matrices
نویسندگان
چکیده مقاله:
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 pages.], some other rank equalities for tripotent matrices are given. Furthermore, we obtain several rank equalities related to some special types of matrices, some of which are available in the literature, from the results established.
منابع مشابه
On the Open Problem Related to Rank Equalities for the Sum of Finitely Many Idempotent Matrices and Its Applications
Tian and Styan have shown many rank equalities for the sum of two and three idempotent matrices and pointed out that rank equalities for the sum P₁ + ⋯+P k with P₁,…, P k be idempotent (k > 3) are still open. In this paper, by using block Gaussian elimination, we obtained rank equalities for the sum of finitely many idempotent matrices and then solved the open problem mentioned above. Extension...
متن کاملSome Equalities Connected with Fuzzy Soft Matrices
E cannot always use the classical methods to solve complicated problems in economics, engineering, social sciences, medical sciences etc. because different types of uncertainties are present in these theories. These days so many theories are available to deal with such type of uncertainties, such as, theory of fuzzy sets [1], theory of intuitionistic fuzzy sets [2], [3], theory of vague sets [4...
متن کاملRank Equalities Related to Generalized Inverses of Matrices and Their Applications
This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses of matrices. Through this method we establish a variety of valuable rank equalities related to generalized inverses of matrices mentioned above. Using them,...
متن کاملOn solubility of groups with finitely many centralizers
For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...
متن کاملOn Nonsingularity of Linear Combinations of Tripotent Matrices
Let T1 and T2 be two commuting n × n tripotent matrices and c1, c2 two nonzero complex numbers. The problem of when a linear combination of the form T = c1T1 + c2T2 is nonsingular is considered. Some other nonsingularitytype relationships for tripotent matrices are also established. Moreover, a statistical interpretation of the results is pointed out.
متن کاملThe lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for [Formula: see text] ([Formula: see text] is an eigenvalue of a matrix) by using the partitioned matrices. By using this estimation and inequality theory, the new and more accurate estimations for the lower bounds for the rank are deduced....
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 43 شماره 5
صفحات 1479- 1493
تاریخ انتشار 2017-10-31
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023